After the introduction of federated learning technology in intrusion detection scenarios， there is a problem that the traffic data between nodes is non-independent and identically distributed （non-iid）， which makes it difficult for models to aggregate and obtain a high recognition rate. To solve this problem， an efficient federated learning algorithm named H?E?Fed was constructed， and a network intrusion detection model based on this algorithm was proposed. Firstly， a global model for traffic data was designed by the coordinator and was sent to the intrusion detection nodes for model training. Then， by the coordinator， the local models were collected and the skewness of the covariance matrix of the local models between nodes was evaluated， so as to measure the correlation of models between nodes， thereby reassigning model aggregation parameters and generating a new global model. Finally， multiple rounds of interactions between the coordinator and the nodes were carried out until the global model converged. Experimental results show that compared with the models based on FedAvg （Federated Averaging） algorithm and FedProx algorithm， under data non-iid phenomenon between nodes， the proposed model has the communication consumption relatively low. And on KDDCup99 dataset and CICIDS2017 dataset， compared with baseline models， the proposed model has the accuracy improved by 10.39%， 8.14% and 4.40%， 5.98% respectively.